The chromatic equivalence class of K1,n,n+2
نویسندگان
چکیده
منابع مشابه
The Chromatic Equivalence Class of Graph
By h(G, x) and P (G, λ) we denote the adjoint polynomial and the chromatic polynomial of graph G, respectively. A new invariant of graph G, which is the fourth character R4(G), is given in this paper. Using the properties of the adjoint polynomials, the adjoint equivalence class of graph Bn−6,1,2 is determined, which can be regarded as the continuance of the paper written by Wang et al. [J. Wan...
متن کاملCombinatorial equivalence of Chromatic Scheduling Polytopes
Point-to-Multipoint systems are one kind of radio systems supplying wireless access to voice/data communication networks. Capacity constraints typically force the reuse of frequencies but, on the other hand, no interference must be caused thereby. This leads to the bandwidth allocation problem, a special case of so-called chromatic scheduling problems. Both problems are NP-Hard, and there exist...
متن کاملChromatic Equivalence of Generalized Ladder Graphs
A class of graphs called generalized ladder graphs is defined. A sufficient condition for pairs of these graphs to be chromatically equivalent is proven. In addition a formula for the chromatic polynomial of a graph of this type is proven. Finally, the chromatic polynomials of special cases of these graphs are explicitly computed.
متن کاملchromatic and clique numbers of a class of perfect graphs
let $p$ be a prime number and $n$ be a positive integer. the graph $g_p(n)$ is a graph with vertex set $[n]={1,2,ldots ,n}$, in which there is an arc from $u$ to $v$ if and only if $uneq v$ and $pnmid u+v$. in this paper it is shown that $g_p(n)$ is a perfect graph. in addition, an explicit formula for the chromatic number of such graph is given.
متن کاملEquivalence Class Subset Algorithm
The equivalence class subset algorithm is a powerful tool for solving a wide variety of constraint satisfaction problems and is based on the use of a decision function which has a very high but not perfect accuracy. Perfect accuracy is not required in the decision function as even a suboptimal solution contains valuable information that can be used to help find an optimal solution. In the harde...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2015
ISSN: 0012-365X
DOI: 10.1016/j.disc.2014.12.013